Decision Trees and Multi-Valued Attributes
نویسنده
چکیده
Common induction systems that construct decision-trees have been reported to operate unsatisfactorily when there are attributes with varying numbers of discrete possible values. This paper highlights the deficiency in the evaluation of the relevance of attributes and examines a proposed solution. An alternative method of selecting an attribute is introduced which permits the use of redundant attributes. Results of experiments on two tasks using the various selection criteria are reported.
منابع مشابه
A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملSolving robot selection problem by a new interval-valued hesitant fuzzy multi-attributes group decision method
Selecting the most suitable robot among their wide range of specifications and capabilities is an important issue to perform the hazardous and repetitive jobs. Companies should take into consideration powerful group decision-making (GDM) methods to evaluate the candidates or potential robots versus the selected attributes (criteria). In this study, a new GDM method is proposed by utilizi...
متن کاملOptimized Fuzzy Decision Tree for Structured Continuous-Label Classification
Mainly understandable decision trees have been intended for perfect symbolic data. Conventional crisp decision trees (DT) are extensively used for classification purpose. However, there are still many issues particularly when we used the numerical (continuous valued) attributes. Structured continuouslabel classification is one type of classification in which the label is continuous in the data....
متن کاملDiscretization of Continuous-valued Attributes and Instance-based Learning
Recent work on discretization of continuous-valued attributes in learning decision trees has produced some positive results. This paper adopts the idea of discretization of continuous-valued attributes and applies it to instance-based learning (Aha, 1990; Aha, Kibler & Albert, 1991). Our experiments have shown that instance-based learning (IBL) usually performs well in continuous-valued attribu...
متن کاملA Survey of Information Theory Application on Data Mining
In data mining area, "classification" is one of the most important isses. The approach of decision trees generated is a very useful and reliable solution. For the construction of a decision tree, there are several ways. Among them, Information Theory is a very effective and scalable method. This is a survey project in Information Theory. We focus on the generation of decision tree for classific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013